-
1 Boolean lattice
-
2 Boolean lattice
Большой англо-русский и русско-английский словарь > Boolean lattice
-
3 Boolean lattice
Вычислительная техника: булева решётка -
4 boolean lattice
boole kafesi -
5 Boolean lattice
English-Russian dictionary of computer science and programming > Boolean lattice
-
6 Boolean lattice
-
7 Boolean lattice
Boole kafesi, Boole örgüsü -
8 boolean lattice
boole kafesi -
9 locally Boolean lattice
Математика: локально булева решёткаУниверсальный англо-русский словарь > locally Boolean lattice
-
10 boolean
1. булева переменная2. булевEnglish-Russian dictionary of Information technology > boolean
-
11 lattice
1) структура2) решётка; кристаллическая решётка•- complete lattice
- information lattice
- lattice of descriptionsEnglish-Russian dictionary of computer science and programming > lattice
-
12 body-centered lattice
1. объемноцентрированная решетка2. объемноцентрированная кристаллическая решеткаEnglish-Russian big polytechnic dictionary > body-centered lattice
-
13 girder lattice
-
14 distributive lattice
lattice theory — теория решеток; теория структур
English-Russian dictionary of Information technology > distributive lattice
-
15 булева решетка
Большой англо-русский и русско-английский словарь > булева решетка
-
16 boole kafesi
boolean lattice -
17 булева решетка
Русско-английский словарь по вычислительной технике и программированию > булева решетка
-
18 булева решетка
-
19 booleano
booleano agg. (mat.) Boolean: reticolo booleano, Boolean lattice; algebra booleana, Boolean algebra. -
20 булева решётка
Information technology: Boolean lattice
- 1
- 2
См. также в других словарях:
Boolean lattice — noun The lattice corresponding to a Boolean algebra … Wiktionary
Boolean algebra (structure) — For an introduction to the subject, see Boolean algebra#Boolean algebras. For the elementary syntax and axiomatics of the subject, see Boolean algebra (logic). For an alternative presentation, see Boolean algebras canonically defined. In abstract … Wikipedia
Boolean algebras canonically defined — Boolean algebras have been formally defined variously as a kind of lattice and as a kind of ring. This article presents them more neutrally but equally formally as simply the models of the equational theory of two values, and observes the… … Wikipedia
Lattice gas automaton — Lattice gas automata (LGA) or lattice gas cellular automata (LGCA) methods are a series of cellular automata methods used to simulate fluid flows. It was the precursor to the lattice Boltzmann methods. From the LGCA, it is possible to derive the… … Wikipedia
Boolean algebra (introduction) — Boolean algebra, developed in 1854 by George Boole in his book An Investigation of the Laws of Thought , is a variant of ordinary algebra as taught in high school. Boolean algebra differs from ordinary algebra in three ways: in the values that… … Wikipedia
Lattice Boltzmann methods — (LBM) is a class of computational fluid dynamics (CFD) methods for fluid simulation. Instead of solving the Navier–Stokes equations, the discrete Boltzmann equation is solved to simulate the flow of a Newtonian fluid with collision models such as … Wikipedia
Boolean prime ideal theorem — In mathematics, a prime ideal theorem guarantees the existence of certain types of subsets in a given abstract algebra. A common example is the Boolean prime ideal theorem, which states that ideals in a Boolean algebra can be extended to prime… … Wikipedia
Boolean algebra — This article discusses the subject referred to as Boolean algebra. For the mathematical objects, see Boolean algebra (structure). Boolean algebra, as developed in 1854 by George Boole in his book An Investigation of the Laws of Thought,[1] is a… … Wikipedia
Boolean algebra (logic) — For other uses, see Boolean algebra (disambiguation). Boolean algebra (or Boolean logic) is a logical calculus of truth values, developed by George Boole in the 1840s. It resembles the algebra of real numbers, but with the numeric operations of… … Wikipedia
Lattice (order) — See also: Lattice (group) The name lattice is suggested by the form of the Hasse diagram depicting it. Shown here is the lattice of partitions of a four element set {1,2,3,4}, ordered by the relation is a refinement of . In mathematics, a… … Wikipedia
Boolean domain — In mathematics and abstract algebra, a Boolean domain is a set consisting of exactly two elements whose interpretations include false and true . In mathematics and theoretical computer science, a Boolean domain is usually written as {0,1} or {ot … Wikipedia